Matrix Method for Computing Approximations in Variable Consistency Dominance-Based Rough Set Approach
نویسندگان
چکیده
Lower and upper approximations of upward (downward) union of decision classes in Variable Consistency Dominance-Based Rough Set Approach (VC-DRSA) are the basis for extraction of decision rules, so computations of approximations is a necessary step in knowledge representing and reduction based on VCDRSA. In this paper, a matrix-based method for computing lower approximations of upward and downward union of decision classes at consistency lever lis proposed. Firstly, concepts such as dominance relation matrix, consistency level, Boolean column vector of subset and the comparison operator between matrices are introduced, then a new method for computing approximations in VC-DRSA is given from matrix perspective and its correctness are proved theoretically. Furthermore, the corresponding algorithms are put forward. Finally, the matrix-based algorithms are applied to the calculation of approximations on UCI datasets and its results are compared with a previous non-matrix algorithm. The experimental results demonstrate the feasibility, conciseness and validity of the proposed matrix-based method.
منابع مشابه
Variable Consistency Model of Dominance-Based Rough Sets Approach
Consideration of preference-orders requires the use of an extended rough set model called Dominance-based Rough Set Approach (DRSA). The rough approximations defined within DRSA are based on consistency in the sense of dominance principle. It requires that objects having not-worse evaluation with respect to a set of considered criteria than a referent object cannot be assigned to a worse class ...
متن کاملA Parallel Matrix-Based Approach for Computing Approximations in Dominance-Based Rough Sets Approach
Dominance-based Rough Sets Approach (DRSA) is a useful tool for multi-criteria classification problems solving. Parallel computing is an efficient way to accelerate problems solving. Computation of approximations is a vital step to find the solutions with rough sets methodologies. In this paper, we propose a matrix-based approach for computing approximations in DRSAand design the corresponding ...
متن کاملStochastic dominance-based rough set model for ordinal classification
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has been introduced to deal with the problem of ordinal classification with monotonicity constraints (also referred to as multicriteria classification in decision analysis). However, in real-life problems, in the presence...
متن کاملStatistical Model for Rough Set Approach to Multicriteria Classification
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has been introduced to deal with the problem of multicriteria classification. However, in real-life problems, in the presence of noise, the notions of rough approximations were found to be excessively restrictive, which l...
متن کاملExtended Probabilistic Rough Sets Under a Strict Dominance Relation
In order to handle inconsistencies in ordinal and monotonic information systems, the Variable Consistency Dominance-based Rough Set Approach (VC-DRSA) has been proposed and successfully applied in real decision making. However, there exists an error spread of inconsistencies in VC-DRSA. In this paper, we firstly induce a strict-dominance relation into Variable-Precision Rough Sets (VPRS). Two n...
متن کامل